A New Multi-criteria Convex Quadratic Programming Model for Credit Analysis
نویسندگان
چکیده
Mathematical programming based methods have been applied to credit risk analysis and have proven to be powerful tools. One challenging issue in mathematical programming is the computation complexity in finding optimal solutions. To overcome this difficulty, this paper proposes a Multi-criteria Convex Quadratic Programming model (MCCQP). Instead of looking for the global optimal solution, the proposed model only needs to solve a set of linear equations. We test the model using three credit risk analysis datasets and compare MCCQP results with four well-known classification methods: LDA, Decision Tree, SVMLight, and LibSVM. The experimental results indicate that the proposed MCCQP model achieves as good as or even better classification accuracies than other methods.
منابع مشابه
A Method for Solving Convex Quadratic Programming Problems Based on Differential-algebraic equations
In this paper, a new model based on differential-algebraic equations(DAEs) for solving convex quadratic programming(CQP) problems is proposed. It is proved that the new approach is guaranteed to generate optimal solutions for this class of optimization problems. This paper also shows that the conventional interior point methods for solving (CQP) problems can be viewed as a special case of the n...
متن کاملA Multi-criteria Convex Quadratic Programming model for credit data analysis
Speed and scalability are two essential issues in data mining and knowledge discovery. This paper proposed a mathematical programming model that addresses these two issues and applied the model to Credit Classification Problems. The proposed Multicriteria Convex Quadric Programming (MCQP) model is highly efficient (computing time complexity O(n)) and scalable to massive problems (size of O(10))...
متن کاملA Recurrent Neural Network for Solving Strictly Convex Quadratic Programming Problems
In this paper we present an improved neural network to solve strictly convex quadratic programming(QP) problem. The proposed model is derived based on a piecewise equation correspond to optimality condition of convex (QP) problem and has a lower structure complexity respect to the other existing neural network model for solving such problems. In theoretical aspect, stability and global converge...
متن کاملFGP approach to multi objective quadratic fractional programming problem
Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objecti...
متن کامل